evaluating of feasible solutions on parallel scheduling tasks with dea decision maker

نویسندگان

mirsaeid hosseini shirvani

چکیده

this paper surveys parallel scheduling problems and metrics correlated to and then applys metrics to make decision in comparison to other policy schedulers. parallel processing is new trend in computer science especially in embedded and multicore systems whereas needs more power consumption to reach speed up. the qos requirement for users is to have good responsiveness and for service providers or system owners to have high throughput and low power consumption in parallel processing or embedded multicore systems. moreover, fairness is vital issue to make decision wether the scheduler is good or not. using the metrics is very intricate because misleadling metrics will cause to lose performance and system utility that is why the metrics has been opted cautiously in this paper. however, satisfying all of the objects in which have potentially conflicts is computationally np-hard. so, tradeoff between metrics is needed. this paper indicates dea fdh model based on linear programming that will select the optimal scheduling near to exact solution

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance Assessment of Feasible Scheduling Multiprocessor Tasks Solutions by using DEA FDH method

Abstract: In this paper, an attempt has been made to investigate how DEA FDH method based on linear programming can select one or more efficient scheduling solutions on multiprocessor tasks obtained by any heuristic algorithms through some feasible solutions for NP-complete problems. This article will consider the problem of scheduling multiprocessor tasks with multi–criteria, namely, minimizin...

متن کامل

Evaluation of scheduling solutions in parallel processing using DEA FDH model

This paper gives a new application of DEA to evaluate the scheduling solutions of parallel processing. It evaluates the scheduling solutions of parallel processing using the non-convex DEA model, FDH model. By introducing each solution of parallel processing scheduling as a DMU with some relevant inputs and outputs this paper shows that how the most efficient schedule(s) can be identified.

متن کامل

evaluation of scheduling solutions in parallel processing using dea fdh model

this paper gives a new application of dea to evaluate the scheduling solutions of parallel processing. it evaluates the scheduling solutions of parallel processing using the non-convex dea model, fdh model. by introducing each solution of parallel processing scheduling as a dmu with some relevant inputs and outputs this paper shows that how the most efficient schedule(s) can be identified.

متن کامل

Scheduling multiprocessor tasks on two parallel processors

In this work scheduling multiprocessor tasks on two parallel identical processors is considered. Multiprocessor tasks can be executed by more than one processor at the same moment of time. We analyze scheduling unit execution time and preemptable tasks to minimize schedule length and maximum lateness. Cases with ready times, due-dates and precedence constraints are discussed.

متن کامل

Scheduling preemptable tasks on parallel processors with limited availability

It is well known that in the majority of cases the problem of preemptive task scheduling on m parallel identical processors with the objective of minimizing makespan can be solved in polynomial time. For example, for tree-like precedence constraints the algorithm of Muntz and Co€man can be applied. In this paper, this problem is generalized to cover the case of parallel processors which are ava...

متن کامل

Scheduling Tasks with Communication Delays on Parallel Processors

Let Jn={v1,...,vn} be a set of n jobs to be executed and E a set of precedence constraints on Jn. Assume that we have available a set Mk={m1,...,mk} of k identical machines that are to execute the jobs in Jn such that the time needed by any machine to execute each job in Jn is one unit. Our main result in this paper is to give an O(n log2(n)) algorithm to find an optimal scheduling with communi...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
journal of advances in computer research

ناشر: sari branch, islamic azad university

ISSN 2345-606X

دوره 6

شماره 2 2015

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023